Piecewise affine functions and polyhedral sets∗
نویسندگان
چکیده
منابع مشابه
Optimal complexity reduction of polyhedral piecewise affine systems
This paper focuses on the NP-hard problem of reducing the complexity of piecewise polyhedral systems (e.g. polyhedral piecewise affine (PWA) systems). The results are fourfold. Firstly, the paper presents two computationally attractive algorithms for optimal complexity reduction that, under the assumption that the system is defined over the cells of a hyperplane arrangement, derive an equivalen...
متن کاملPolyhedral methods for piecewise-linear functions I: the lambda method
The \lambda method" is a well-known method for using integer linear-programming methods to model separable piecewise-linear functions in the context of optimization formulations. We extend the lambda method to the nonseparable case, and use polyhedral methods to strengthen the formulation.
متن کاملIrredundant lattice representations of continuous piecewise affine functions
In this paper, we revisit the lattice representation of continuous piecewise affine (PWA) function and give a formal proof of its representation ability. Based on this, we derive the irredundant lattice PWA representation through removal of redundant terms and literals. Necessary and sufficient conditions for irredundancy are proposed. Besides, we explain how to remove terms and literals in ord...
متن کاملOptimistic optimization for continuous nonconvex piecewise affine functions∗
This paper considers the global optimization problem of a continuous nonconvex piecewise affine (PWA) function over a polytope. This type of optimization problem often arises in the context of control of continuous PWA systems. In literature, it has been shown that the given problem can be formulated as a mixed integer linear programming problem, the worst-case complexity of which grows exponen...
متن کاملOn Coordinate Minimization of Convex Piecewise-Affine Functions
A popular class of algorithms to optimize the dual LP relaxation of the discrete energy minimization problem (a.k.a. MAP inference in graphical models or valued constraint satisfaction) are convergent message-passing algorithms, such as max-sum diffusion, TRW-S, MPLP and SRMP. These algorithms are successful in practice, despite the fact that they are a version of coordinate minimization applie...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Optimization
سال: 1994
ISSN: 0233-1934,1029-4945
DOI: 10.1080/02331939408844018